Concurrent Hierarchical Finite State Machines for Modeling Pedestrian Behavioral Tendencies

Hierarchical Concurrent Finite State Machines in Ptolemy

tics. For example, the co-design finite state machines We implement a finite state machine (FSM) domain for specifying and simulating control functionality of a system within the Ptolemy software environment. The FSM domain is successfully integrated with synchronous dataflow (SDF) and discrete-event (DE) concurrency domains in Ptolemy. In this heterogeneous combination, the semantics of FSM, c...

Reconfigurable Hierarchical Finite State Machines

The paper suggests design methods for reconfigurable hierarchical finite state machines (RHFSM), which possess two following important features: 1) they enable the control algorithm to be divided in modules providing direct support for “divide and conquer” strategy; 2) they can be reconfigured both statically and dynamically. Run-time reconfiguration permits virtual control systems to be constr...

A Graphical Editor Proposal for Developing Concurrent, Hierarchical, Finite State Machines

Test Selection for Hierarchical and Communicating Finite State Machines

oracles may be used instead of characterization sets to check the precise or abstract state, respectively, of the cor-

An object-oriented implementation of concurrent and hierarchical state machines

Context: State machine diagrams are a powerful means to describe the behavior of reactive systems. Unfortunately, the implementation of state machines is difficult, because state machine concepts, like states, events and transitions, are not directly supported in commonly used programming languages. Most of the implementation approaches known so far have one or more serious drawbacks: they are ...